224785	An Algorithm for Finding Large Induced Planar Subgraphs
435149	An Empirical Study of a Qualitative Systematic Approach to Requirements Analysis (QSARA)
830903	Detachments of Complete Graphs
830904	The Harmonious Chromatic Number of Almost All Trees
830905	The Harmonious Chromatic Number of Bounded Degree Trees
836674	On monochromatic component size for improper colourings
836675	The Complexity of Harmonious Colouring for Trees
839252	The complexity of some graph colouring problems
847173	The computational complexity of cordial and equitable labelling
847516	Edge decomposition of complete tripartite graphs
851489	The harmonious chromatic number of complete r-ary trees
852031	The achromatic number of bounded degree trees
854234	On a problem concerning piles of counters
855152	Preface
855646	Planarization and fragmentability of some classes of graphs
883356	On the Neighbour-Distinguishing Index of a Graph
975456	Fragmentability of Graphs
1090785	The Complexity of Colouring Problems on Dense Graphs
1377672	A new upper bound for the harmonious chromatic number
1510790	Real-time structured methods: systems analysis
1528220	Jini Example by Example
1557688	Smart homes or homes that smart?
1750383	Intelligibility and accountability: human considerations in context-aware systems
